<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Jamming: tree/sizeBalancedTree.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">Jamming
   &#160;<span id="projectnumber">0.0.1</span>
   </div>
   <div id="projectbrief">An data structure and algorithm template library for quick C++ programming</div>
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">tree/sizeBalancedTree.h</div>  </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * sizeBalancedTree.h</span>
<a name="l00003"></a>00003 <span class="comment"> * This file is part of Jamming</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Copyright (C) 2012 - Yi</span>
<a name="l00006"></a>00006 <span class="comment"> *</span>
<a name="l00007"></a>00007 <span class="comment"> * Jamming is free software; you can redistribute it and/or modify</span>
<a name="l00008"></a>00008 <span class="comment"> * it under the terms of the GNU General Public License as published by</span>
<a name="l00009"></a>00009 <span class="comment"> * the Free Software Foundation; either version 2 of the License, or</span>
<a name="l00010"></a>00010 <span class="comment"> * (at your option) any later version.</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * Jamming is distributed in the hope that it will be useful,</span>
<a name="l00013"></a>00013 <span class="comment"> * but WITHOUT ANY WARRANTY; without even the implied warranty of</span>
<a name="l00014"></a>00014 <span class="comment"> * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the</span>
<a name="l00015"></a>00015 <span class="comment"> * GNU General Public License for more details.</span>
<a name="l00016"></a>00016 <span class="comment"> *</span>
<a name="l00017"></a>00017 <span class="comment"> * You should have received a copy of the GNU General Public License</span>
<a name="l00018"></a>00018 <span class="comment"> * along with Jamming. If not, see &lt;http://www.gnu.org/licenses/&gt;.</span>
<a name="l00019"></a>00019 <span class="comment"> */</span>
<a name="l00020"></a>00020 
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef __SIZEBALANCETREE_H__</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define __SIZEBALANCETREE_H__</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span><span class="preprocessor">#include &lt;stack&gt;</span>
<a name="l00024"></a>00024 <span class="preprocessor">#include &lt;string.h&gt;</span>
<a name="l00025"></a>00025 
<a name="l00026"></a>00026 <span class="keyword">namespace </span>Tree
<a name="l00027"></a>00027 {
<a name="l00028"></a>00028     <span class="keyword">template</span> &lt;<span class="keyword">typename</span> _TypeData&gt;
<a name="l00029"></a><a class="code" href="classTree_1_1sizeBalancedTree.html">00029</a>     <span class="keyword">class </span><a class="code" href="classTree_1_1sizeBalancedTree.html">sizeBalancedTree</a> {
<a name="l00030"></a>00030         <span class="comment">/*</span>
<a name="l00031"></a>00031 <span class="comment">         * sizeBalancedTree is a variance of AVL tree. Instead of </span>
<a name="l00032"></a>00032 <span class="comment">         * keeping the information of tree depth,it keeps the information of tree size.</span>
<a name="l00033"></a>00033 <span class="comment">         * It thus can be used to find kth element.</span>
<a name="l00034"></a>00034 <span class="comment">         */</span>
<a name="l00035"></a>00035         <span class="keyword">struct </span>Node {
<a name="l00036"></a>00036             <span class="keywordtype">int</span> size;
<a name="l00037"></a>00037             <span class="keywordtype">int</span> child[2];
<a name="l00038"></a>00038             _TypeData data;
<a name="l00039"></a>00039         };
<a name="l00040"></a>00040         Node* mytree;
<a name="l00041"></a>00041         <span class="keywordtype">int</span> size,max_size;
<a name="l00042"></a>00042         <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> LEFT=0,RIGHT=1,Null=0;
<a name="l00043"></a>00043         <span class="keywordtype">int</span> idxInt;
<a name="l00044"></a>00044         stack&lt;int&gt; deletedspace;
<a name="l00045"></a>00045         <span class="comment">//Internal memory management</span>
<a name="l00046"></a>00046         <span class="keywordtype">int</span> newNode(_TypeData &amp;data) {
<a name="l00047"></a>00047             <span class="keywordtype">int</span> idx;
<a name="l00048"></a>00048             <span class="keywordflow">if</span>(!deletedspace.empty()) {idx=deletedspace.top();deletedspace.pop();} 
<a name="l00049"></a>00049             <span class="keywordflow">else</span> {
<a name="l00050"></a>00050                 <span class="keywordflow">if</span>(++size &gt; max_size) resize(2*max_size);
<a name="l00051"></a>00051                 idx=size;
<a name="l00052"></a>00052             }
<a name="l00053"></a>00053 <span class="preprocessor">#ifdef USE_MEMCPY</span>
<a name="l00054"></a>00054 <span class="preprocessor"></span>            memcpy(&amp;mytree[idx].data,&amp;data,<span class="keyword">sizeof</span>(_TypeData));
<a name="l00055"></a>00055 <span class="preprocessor">#else</span>
<a name="l00056"></a>00056 <span class="preprocessor"></span>            mytree[idx].data=data;
<a name="l00057"></a>00057 <span class="preprocessor">#endif</span>
<a name="l00058"></a>00058 <span class="preprocessor"></span>            mytree[idx].child[LEFT]=mytree.child[RIHGT]=Null;
<a name="l00059"></a>00059             <span class="keywordflow">return</span> idx;
<a name="l00060"></a>00060         };
<a name="l00061"></a>00061         <span class="keywordtype">void</span> deleteNode(<span class="keywordtype">int</span> idx) {
<a name="l00062"></a>00062             deletedspace.push(idx);
<a name="l00063"></a>00063         };
<a name="l00064"></a>00064         <span class="keywordtype">void</span> resize(<span class="keywordtype">int</span> newSize) {
<a name="l00065"></a>00065             Node* newBuffer=<span class="keyword">new</span> Node[newSize+1];
<a name="l00066"></a>00066             <span class="keywordflow">if</span> (!mytree) { 
<a name="l00067"></a>00067                 memcpy(newBuffer,mytree,(max_size+1)*<span class="keyword">sizeof</span>(Node));
<a name="l00068"></a>00068                 <span class="keyword">delete</span> mytree [];
<a name="l00069"></a>00069             }
<a name="l00070"></a>00070             max_size=newSize;
<a name="l00071"></a>00071             mytree=newBuffer;
<a name="l00072"></a>00072         };
<a name="l00073"></a>00073         <span class="comment">//Tree maintainance</span>
<a name="l00074"></a>00074         <span class="keyword">inline</span> <span class="keywordtype">void</span> rotate(<span class="keywordtype">int</span> &amp;idxOldRoot,<span class="keywordtype">int</span> right) {
<a name="l00075"></a>00075             <span class="keywordtype">int</span> idxNewRoot=mytree[idxOldRoot].child[right];
<a name="l00076"></a>00076             mytree[idxOldRoot].child[right]=mytree[idxNewRoot].child[!right];
<a name="l00077"></a>00077             mytree[idxNewRoot].child[!right]=idxOldRoot;
<a name="l00078"></a>00078             mytree[idxNewRoot].size=mytree[idxOldRoot].size;
<a name="l00079"></a>00079             mytree[idxOldRoot].size=mytree[mytree[idxOldRoot].child[LEFT]].size+mytree[mytree[idxOldRoot].child[RIGHT]].size+1;
<a name="l00080"></a>00080             idxOldRoot=idxNewRoot;
<a name="l00081"></a>00081         };
<a name="l00082"></a>00082         maintain(<span class="keywordtype">int</span> &amp;idxSubTree,<span class="keywordtype">bool</span> isRight) {
<a name="l00083"></a>00083             <span class="keywordflow">if</span>(mytree[mytree[mytree[idxSubTree].child[isRight]].child[isRight]].size &gt;mytree[mytree[idxSubTree].child[!isRight]].size) {
<a name="l00084"></a>00084                 rotate(idxSubTree,isRight);
<a name="l00085"></a>00085             } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(mytree[mytree[mytree[idxSubTree].child[isRight]].child[!isRight]].size &gt; mytree[mytree[idxSubTree].child[isLeft]].size ) {
<a name="l00086"></a>00086                 rotate(idxSubTree,isRight);
<a name="l00087"></a>00087                 rotate(idxSubTree,isRight);
<a name="l00088"></a>00088             } <span class="keywordflow">else</span> <span class="keywordflow">return</span>;
<a name="l00089"></a>00089             maintain(mytree[idxSubTree].child[LEFT],LEFT);
<a name="l00090"></a>00090             maintain(mytree[idxSubTree].child[RIGHT],RIGHT);
<a name="l00091"></a>00091             maintain(idxSubTree,LEFT);
<a name="l00092"></a>00092             maintain(idxSubTree,RIGHT);
<a name="l00093"></a>00093         }
<a name="l00094"></a>00094         <span class="comment">//Tree operation</span>
<a name="l00095"></a>00095         <span class="keywordtype">bool</span> insertTosubtree(Node* &amp;node,_TypeData data) {
<a name="l00096"></a>00096             <span class="keywordflow">if</span>(!node) {
<a name="l00097"></a>00097                 <span class="keywordtype">int</span> idx=newNode();
<a name="l00098"></a>00098             }
<a name="l00099"></a>00099         };
<a name="l00100"></a>00100         <span class="keywordtype">bool</span> removeFromsubtree(Node* &amp;node,_TypeData data) {
<a name="l00101"></a>00101             
<a name="l00102"></a>00102         };
<a name="l00103"></a>00103         <span class="keyword">public</span>:
<a name="l00104"></a>00104         <a class="code" href="classTree_1_1sizeBalancedTree.html">sizeBalancedTree</a>(<span class="keywordtype">int</span> reserve_size=10) {
<a name="l00105"></a>00105             resize(reserve_size);
<a name="l00106"></a>00106             mytree[Null].child[LEFT]=mytree[Null].child[RIGHT]=Null;
<a name="l00107"></a>00107         }
<a name="l00108"></a>00108         insert();
<a name="l00109"></a>00109         <span class="keyword">remove</span>();
<a name="l00110"></a>00110         find();
<a name="l00111"></a>00111         bound(<span class="keyword">const</span> _TypeData &amp;data,<span class="keywordtype">int</span> &amp;idxBound[]) {
<a name="l00112"></a>00112             <span class="keywordtype">int</span> idxCurrNode=root;
<a name="l00113"></a>00113             <span class="keywordflow">while</span>(idxCurrNode) {
<a name="l00114"></a>00114                 <span class="keywordtype">int</span> isRight=data &gt; mytree[idxCurrNode].data;
<a name="l00115"></a>00115                 <span class="keywordtype">int</span> isEqual=data == mytree[idxCurrNode].data;
<a name="l00116"></a>00116                 <span class="keywordflow">if</span>(!isEqual) {
<a name="l00117"></a>00117                     idxBound[isRight]=idxCurrNode;
<a name="l00118"></a>00118                     idxCurrNode=mytree[idxCurrNode].child[isRight];
<a name="l00119"></a>00119                 }
<a name="l00120"></a>00120             }
<a name="l00121"></a>00121         }; 
<a name="l00122"></a>00122         <span class="keywordtype">int</span> rank(<span class="keywordtype">int</span> idxNode) {
<a name="l00123"></a>00123             <span class="keywordtype">int</span> idxCurrNode=root;
<a name="l00124"></a>00124             <span class="keywordtype">int</span> rank=mytree[root].size+1;
<a name="l00125"></a>00125             <span class="keywordflow">while</span>(idxCurrNode) {
<a name="l00126"></a>00126                 <span class="keywordtype">int</span> isRight=mytree[idxNode].data &gt; mytree[idxCurrNode].data;
<a name="l00127"></a>00127                 <span class="keywordtype">int</span> isEqual=mytree[idxNode].data == mytree[idxCurrNode].data;
<a name="l00128"></a>00128                 <span class="keywordflow">if</span>(!isEqual) {idxCurrNode=mytree[idxCurrNode].child[isRight];
<a name="l00129"></a>00129                     rank+=(mytree[mytree[idxCurrNode].child[!isRight]].size+1)*(isRight?1:-1);
<a name="l00130"></a>00130                 }
<a name="l00131"></a>00131             }
<a name="l00132"></a>00132             <span class="comment">//not found in the tree</span>
<a name="l00133"></a>00133         };
<a name="l00134"></a>00134         _TypeData select(<span class="keywordtype">int</span> k) {
<a name="l00135"></a>00135             <span class="keywordtype">int</span> idxCurrNode=root;
<a name="l00136"></a>00136             <span class="keywordflow">while</span>(idxCurrNode) {
<a name="l00137"></a>00137                 <span class="keywordtype">int</span> leftSize=mytree[mytree[idxCurrNode].child[LEFT]].size;
<a name="l00138"></a>00138                 <span class="keywordflow">if</span>(k==leftSize+1) {<span class="keywordflow">return</span> mytree[idxCurrNode].data}
<a name="l00139"></a>00139                 <span class="keywordflow">if</span>(k&gt;leftSize+1) {idxCurrNode=mytree[mytree[idxCurrNode].child[RIGHT]];k-=leftSize+1;}
<a name="l00140"></a>00140                 <span class="keywordflow">else</span> {idxCurrNode=mytree[mytree[idxCurrNode].child[LEFT]];} 
<a name="l00141"></a>00141             }
<a name="l00142"></a>00142             <span class="comment">//k&gt; size , raise error;</span>
<a name="l00143"></a>00143         };
<a name="l00144"></a>00144     };
<a name="l00145"></a>00145 };
<a name="l00146"></a>00146 
<a name="l00147"></a>00147 
<a name="l00148"></a>00148 <span class="preprocessor">#endif </span><span class="comment">/* __SIZEBALANCETREE_H__ */</span>
<a name="l00149"></a>00149 
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Typedefs</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sat Jan 26 2013 22:18:27 for Jamming by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>

</body>
</html>
